A Global Constraint for Cutset Problems
نویسنده
چکیده
منابع مشابه
A constraint programming approach to cutset problems
We consider the problem of finding a cutset in a directed graph G = (V, E), i.e. a set of vertices that cuts all cycles in G. Finding a cutset of minimum cardinality is NP-hard. There exist several approximate and exact algorithms, most of them using graph reduction techniques. In this paper we propose a constraint programming approach to cutset problems and design a global constraint for compu...
متن کاملBenefits and Problems of using cycle-cutset within interative improvement algorithms
Some experiments on randomly generated partial constraint satisfaction problems as well as an example from the domain of real world nurse rostering illustrate the advantage of the cyclecutset method as a repair step in iterative search. These results motivate the integration of adopted algorithms on solving tree-structured constraint problems and the cycle-cutset method into modern constraint-b...
متن کاملImproving Connectionist Energy Minimization
Symmetric networks designed for energy minimization such as Boltzman machines and Hop eld nets are frequently investigated for use in optimization, constraint satisfaction and approximation of NP-hard problems. Nevertheless, nding a global solution (i.e., a global minimum for the energy function) is not guaranteed and even a local solution may take an exponential number of steps. We propose an ...
متن کاملA Graph-Based Method for Improving GSAT
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satisfiability and constraint satisfaction problems. We present an improvement to GSAT that is sensitive to the problem’s structure. When the problem has a tree structure the algorithm is guaranteed to find a solution in linear time. For non-tree networks, the algorithm designates a subset of nodes,...
متن کاملA Soft Global Precedence Constraint
Hard and soft precedence constraints play a key role in many application domains. In telecommunications, one application is the configuration of callcontrol feature subscriptions where the task is to sequence a set of user-selected features subject to a set of hard (catalogue) precedence constraints and a set of soft (user-selected) precedence constraints. When no such consistent sequence exist...
متن کامل